The Generalized Max-Min Fairness Policy for Elastic Traffic based on Linear Programming
نویسندگان
چکیده
Most of elastic traffic calls require a rate between certain limits, while it is essential for a bandwidth allocation mechanism to allocate the available bandwidth in a fair manner among the elastic calls. Therefore, the min and max bandwidth requirements of calls have to be taken into account in the bandwidth allocation process. Such a process is the Generalized Max-Min Fairness policy (GMM). It has been described without mathematical support in a five-step procedure, in which the fairness criteria are given without coming into details. In this paper, we propose a new algorithm for the GMM policy, in a clear mathematical way, based on Linear Programming (LP), and it is directly convertible into computer software. To clarify the proposed new algorithm, we present selected numerical examples on a well-established testbed network.
منابع مشابه
A parametric Linear Programming Model Describing Bandwidth Sharing Policies for ABR Traffic
We consider the fair bandwidth allocation problem of ABR calls by a Connection Admission Controller (CAC) at call setup. Its general solution is given by applying the “max-min fairness allocation policy”. Extensions of this policy take into account the Minimum Cell Rate (MCR) and the Peak Cell Rate (PCR) traffic description parameters, which are essential for ABR. These extensions are distingui...
متن کاملOn the performance and fairness of dynamic channel allocation in wireless mesh networks
Channel assignment in multi-channel multi-radio wireless mesh networks is a powerful resource management tool to exploit available multiple channels. Channels can be allocated either statically based on long-term steady state behavior of traffic or dynamically according to actual traffic demands. It is a common belief that dynamic schemes provide better performance; however, these two broad cla...
متن کاملBandwidth sharing and admission control for elastic traffic
We consider the performance of a network like the Internet handling so-called elastic traffic where the rate of flows adjusts to fill available bandwidth. Realized throughput depends both on the way bandwidth is shared and on the random nature of traffic. We assume traffic consists of point to point transfers of individual documents of finite size arriving according to a Poisson process. Notabl...
متن کاملCalcul de Routages Equitables dans les Réseaux Internet
In this paper we consider the problem of fair routing in multicommodity networks. We present here an algorithm for calculating fair routing in a network where the available resources are shared among competing flows according to a max-min share criterion. Our main interest is computing optimal routing paths with regard to max-min fairness, in stable and known traffic conditions. It is a linear ...
متن کاملFair and efficient network dimensioning with the reference point methodology
The dimensioning of telecommunication networks that carry elastic traffic requires the fulfillment of two conflicting goals: maximizing the total network throughput and providing fairness to all flows. Fairness in telecommunication network design is usually provided using the so-called max-min fairness (MMF) approach. However, this approach maximizes the performance of the worst (most expensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004